The homological arrow polynomial for virtual links

نویسندگان

چکیده

The arrow polynomial is an invariant of framed oriented virtual links that generalizes the Kauffman bracket. In this paper we define homological polynomial, which to with labeled components. key observation that, given a link in thickened surface, homology class defines functional on surface's skein module, and by applying it image module gives invariant. We give graphical calculus for taking usual diagrams bracket including "whiskers" record intersection numbers each component link. use study $(\mathbb{Z}/n\mathbb{Z})$-nullhomologous checkerboard colorability, giving new way complete Imabeppu's characterization colorability up four crossings. also prove version Kauffman-Murasugi-Thistlethwaite theorem breadth evaluation "h-reduced" diagram $D$ $4(c(D)-g(D)+1)$.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Virtual Crossing Number and the Arrow Polynomial

We introduce a new polynomial invariant of virtual knots and links and use this invariant to compute a lower bound on the virtual crossing number and the minimal surface genus. 1 The arrow polynomial We introduce the arrow polynomial, an invariant of oriented virtual knots and links that is equivalent to the simple extended bracket polnomial [6]. This invariant takes values in the ring Z[A,A, K...

متن کامل

On two categorifications of the arrow polynomial for virtual knots

Two categorifications are given for the arrow polynomial, an extension of the Kauffman bracket polynomial for virtual knots. The arrow polynomial extends the bracket polynomial to infinitely many variables, each variable corresponding to an integer arrow number calculated from each loop in an oriented state summation for the bracket. The categorifications are based on new gradings associated wi...

متن کامل

A Polynomial Invariant for Flat Virtual Links

In searching for methods to distinguish knots and links, recent work has focussed on the more general virtual knots and links, introduced by Kauffman in [2]. If we ignore the over/under information at each crossing, we obtain a flat virtual knot or link (still called a knot or a link), sometimes called the universe of the original virtual knot or link. It is a triviality that if the original vi...

متن کامل

Polynomial Invariants of Virtual Links

Properties of polynomial invariants ∆i for oriented virtual links are established. The effects of taking mirror images and reversing orientation of the link diagram are described. The relationship between ∆0(u, v) and an invariant of F. Jaeger, L. Kauffman, H. Saleur and J. Sawollek is discussed.

متن کامل

Computing the Arrow Polynomial

Determining if two knots are not equivalent in an e cient manner is important in the study of knots. The arrow polynomial, which is calculated from a virtual knot diagram and is invariant under the Reidemeister moves, can be used to determine if two knots are not equivalent and determine a lower bound on the virtual crossing number. In this paper, we present the necessary data structures and al...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Knot Theory and Its Ramifications

سال: 2023

ISSN: ['1793-6527', '0218-2165']

DOI: https://doi.org/10.1142/s0218216523500050